An Efficient Key Pre - distribution Scheme for Multiple Attacks

Probabilistic Key pre-distribution schemes (P-KPSs) are candidates for securing interactions between resource limited computer networks. Collusion susceptible P-KPSs are trade-offs between security and complexity and security include resistance to passive eavesdropping attacks, and active message injection attacks. The existing work presented the P-KPS, the subset keys and identity tickets (SKIT) scheme, SI Scheme, MBK Scheme whose performance were compared with deterministic KPS model to facilitate facets of the complexity of key pre-distribution schemes. The security model described the resistance of P-KPSs to active message-injection attacks. Most of the existing schemes are based on probabilistic approach and shows poor resiliency against coalition attack and connectivity. The storage costs of deterministic schemes are all relatively high and easy to support large size networks. The proposed work presented a resilient deterministic key pre-distribution scheme which show better detection against coalition attack. For the neighboring nodes in the same group, the polynomial-based key pre-distribution scheme is used to generate pair wise keys for them. And for the neighboring nodes in different groups, the binding secrets generated by a ECC are used to establish the pair wise key. Index Terms Probabilistic Key pre-distribution schemes , subset keys and identity tickets (SKIT) scheme, SI Scheme, MBK Scheme resilient deterministic key pre-distribution scheme, polynomial-based key pre-distribution scheme.